Node-based valid inequalities for the optimal transmission switching problem
نویسندگان
چکیده
The benefits of transmission line switching are well-known in terms reducing operational cost and improving system reliability power systems. However, finding the optimal network configuration is a challenging task due to combinatorial nature underlying optimization problem. In this work, we identify certain "node-based" set that appears as substructure problem then conduct polyhedral study set. We construct an extended formulation integer hull present inequality description original space some cases. These inequalities can be used cutting-planes for Finally, results our computational experiments using these on difficult test cases from literature.
منابع مشابه
A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching
It is well-known that optimizing network topology by switching on and off transmission lines improves the efficiency of power delivery in electrical networks. In fact, the USA Energy Policy Act of 2005 (Section 1223) states that the U.S. should “encourage, as appropriate, the deployment of advanced transmission technologies” including “optimized transmission line configurations.” As such, many ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut
In this paper we consider the k-node-connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We introduce further classes of valid inequalities and discuss their facial aspect. We also devise separation routines, investigate the structural properties of the linear relaxation and discuss some reduction operations t...
متن کاملSome Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem
In this paper we describe some results on the linear integer programming formulation of the Probabilistic Minimum Power Multicast (PMPM) problem for wireless networks. The PMPM problem consists in optimally assigning transmission powers to the nodes of a given network in order to establish a multihop connection between a source node and a set of destination nodes. The nodes are subject to failu...
متن کاملValid inequalities for the synchronization bus timetabling problem
Bus transit network planning is a complex process that is divided into several phases such as: line planning, timetable generation, vehicle scheduling, and crew scheduling. In this work, we address the timetable generation which consists in scheduling the departure times for all trips of each bus line. We focus on the Synchronization Bus Timetabling Problem (SBTP) that favors passenger transfer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2022
ISSN: ['1873-636X', '1572-5286']
DOI: https://doi.org/10.1016/j.disopt.2021.100683